Propagation Completeness of Reactive Constraints
نویسنده
چکیده
We develop a framework for addressing correctness and timeliness-of-propagation issues for reactive constraints-global constraints or user-deened constraints that are implemented through constraint propagation. The notion of propagation completeness is introduced to capture timeliness of constraint propagation. A generalized form of arc-consistency is formulated which uniies many local consistency conditions in the literature. We show that propagation complete implementations of reactive constraints achieve this arc-consistency when propagation quiesces. Finally, we use the framework to state and prove an impossibility result: that CHR cannot implement a common relation with a desirable degree of timely constraint propagation.
منابع مشابه
Some Remarks on Boolean Constraint Propagation
We study here the well-known propagation rules for Boolean constraints. First we propose a simple notion of completeness for sets of such rules and establish a completeness result. Then we show an equivalence in an appropriate sense between Boolean constraint propagation and unit propagation, a form of resolution for propositional logic. Subsequently we characterize one set of such rules by mea...
متن کاملKnowledge Compilation with Empowerment
When we encode constraints as Boolean formulas, a natural question is whether the encoding ensures a ”propagation completeness” property: is the basic unit propagation mechanism able to deduce all the literals that are logically valid? We consider the problem of automatically finding encodings with this property. Our goal is to compile a naı̈ve definition of a constraint into a good, propagation...
متن کاملDominance Constraints with Set Operators
Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by admitting set operators. We present a solver for dominance constraints with set operators, which is based on propagation and distribution rules, and prove its soundness and completeness. From this solver, we derive an implement...
متن کاملExploiting the Structure of Hierarchical Plans in Temporal Constraint Propagation
Quantitative temporal constraints are an essential requirement for many planning domains. The HTN planning paradigm has proven to be better suited than other approaches to many applications. To date, however, efficiently integrating temporal reasoning with HTN planning has been little explored. This paper describes a means to exploit the structure of a HTN plan in performing temporal propagatio...
متن کاملDominance constraints with Boolean connectives: a model-eliminative treatment
Dominance constraints are a language of tree descriptions. Tree descriptions are widely used in computational linguistics for talking and reasoning about trees. While previous research has focused on the conjunctive fragment, we now extend the account to all Boolean connectives and propose a new formalism that combines dominance constraints with a feature tree logic. Although the satisfiability...
متن کامل